The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
نویسندگان
چکیده
منابع مشابه
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for tournaments. A feedback arc set (fas) in a digraph D = (V,A) is a set F of arcs such that D \F is acyclic. The size of a minimum feedback arc set of D is denoted by mfas(D). A classical result of Lawler and Karp [5] asserts that finding a minimum feedback arc set in a digraph...
متن کاملFeedback arc set in bipartite tournaments is NP-complete
The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NPcomplete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs.
متن کاملFeedback Arc Set Problem in Bipartite Tournaments
In this paper we give ratio 4 deterministic and randomized approximation algorithms for the FEEDBACK ARC SET problem in bipartite tournaments. We also generalize these results to give a factor 4 deterministic approximation algorithm for FEEDBACK ARC SET problem in multipartite tournaments. © 2007 Elsevier B.V. All rights reserved.
متن کاملKernels for Feedback Arc Set In Tournaments
A tournament T = (V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is known as the k-Feedback Arc Set in Tou...
متن کاملAn Exact Method for the Minimum Feedback Arc Set Problem
Given a directed graph G, a feedback arc set of G is a subset of its edges containing at least one edge of every cycle in G. Finding a feedback arc set of minimum cardinality is the minimum feedback arc set problem. The minimum set cover formulation of the minimum feedback arc set problem is appropriate as long as all the simple cycles in G can be enumerated. Unfortunately, even sparse graphs c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2006
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548306007887